Hinging hyperplanes for regression, classification, and function approximation
نویسنده
چکیده
A hinge function y = h (x) consists of two hyperplanes continuously joined together at a hinge. In regression (prediction), classification (pattern recognition), and noiseless function approximation, use of sums of hinge functions gives a powerful and efficient altemative to neural networks with compute times several orders of magnitude less than fitting neural networks with a comparable number of parameters. The core of the methodology is a simple and effective method for finding good hinges. 1). Introduction In an M-dimensional space (xl,... , XM), a hinge function y = h (x) consists of two hyperplanes continuously joined together. Taking xo 1 and using to denote the inner product of two vectors, if the two hyperplanes are given by y= x, y=P=-X, they are joined together on (x: ( P W) x = 01 and we refer to A = (3, or any multiple of A, as the hinge for the function. The explicit form of the hinge function is either max ([+ x,px) or min ((+x, .x). Most of the recently introduced methods for nonlinear regression, classification, and function approximation use expansions into sums of basis functions. The basis functions used are "data selected" from a large parametric class of primitive functions. For instance, CART (Breiman et al. [1984]) uses an expansion into indicator functions of multidimensional rectangles with sides parallel to the coordinate axes. Neural network methods use sigmoid functions of linear functions as primitives. The MARS method (Friedman [1991]) uses products of univariate linear spline functions as its primitive class. In this work, the hinge functions form the primitive class. There are good reasons, as given below, for this approach. Let P be any measure with compact support on E(M) and f(x) any sufficiently smooth function. Then we show in section 3, using methods developed by Jones [1991] and Barron [1991] that there is a constant C(f,P) such that for any K, there are hinge functions hl,... , hK with K C if-_hkII2 C. 1 K
منابع مشابه
Smooth Hinging Hyperplanes { an Alternative to Neural Nets
Recently a novel approach to nonlinear function approximation using hinging hyperplanes, was reported by L. Breiman 3]. In this contribution we have combined smooth hinging hyperplanes and the eecient initializa-tion procedure existing for hinging hyperplanes in 3], with a Gauss-Newton procedure, see 4], to perform the nal adjustment of the smooth hinging hyperplanes. This combination uses the ...
متن کاملAdaptive Hinging Hyperplanes
The model of adaptive hinging hyperplanes (AHH) is proposed in this paper for black-box modeling. It is based on Multivariate Adaptive Regression Splines (MARS) and Generalized Hinging Hyperplanes (GHH) and shares attractive properties of the two. By making a modification to the basis function of MARS, AHH shows linear property in each subarea. It is proved that AHH model is identical to a spec...
متن کاملIdentification of Hinging Hyperplane Models by Fuzzy c-Regression Clustering
This article deals with the identification of the so called hinging hyperplane models. This type of non-linear black-box models is relatively new, and its identification is not thoroughly examined and discussed so far. They can be an alternative to artificial neural nets but there is a clear need for an effective identification method. This paper presents a new identification technique for that...
متن کاملHinging Hyperplanes for Non-Linear Identi cation
The hinging hyperplane method is an elegant and eecient way of identifying piecewise linear models based on the data collected from an unknown linear or nonlinear system. This approach provides \a powerful and eecient alternative to neural networks with computing times several orders of magnitude less than tting neural networks with a comparable number of parameters", as stated in 3]. In this r...
متن کاملHinging hyperplane based regression tree identified by fuzzy clustering and its application
Hierarchical fuzzy modeling techniques have great advantage since model accuracy and complexity can be easily controlled thanks to the transparent model structures. A novel tool for regression tree identification is proposed based on the synergistic combination of fuzzy c-regression clustering and the concept of hierarchical modeling. In a special case (c = 2), fuzzy c-regression clustering can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 39 شماره
صفحات -
تاریخ انتشار 1993